The quadratic knapsack problem—a survey
نویسندگان
چکیده
منابع مشابه
Stochastic Quadratic Knapsack with Recourse
This paper is dedicated to a study of different extensions of the classical knapsack problem to the case when different elements of the problem formulation are subject to a degree of uncertainty described by random variables. This brings the knapsack problem into the realm of stochastic programming. Four different model formulations are proposed, based on the introduction of probability constra...
متن کاملExact Solution of the Quadratic Knapsack Problem
The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint, where all coeecients are assumed to be nonnegative and all variables are binary. The problem has applications in location and hydrology, and generalizes the problem of checking whether a graph contains a clique of a given size. We propose an exact branch-and-bound algorithm...
متن کاملThe Separable Convex Quadratic Knapsack Problem
This paper considers the problem of minimizing a convex, separable quadratic function subject to a knapsack constraint and a box constraint. An algorithm called NAPHEAP is developed for solving this problem. The algorithm solves the Karush-Kuhn-Tucker system using a starting guess to the optimal Lagrange multiplier and updating the guess monotonically in the direction of the solution. The start...
متن کاملApproximation of the Quadratic Knapsack Problem
We study the approximability of the classical quadratic knapsack problem (QKP) on special graph classes. In this case the quadratic terms of the objective function are not given for each pair of knapsack items. Instead an edge weighted graph G = (V, E) whose vertices represent the knapsack items induces a quadratic profit p ij for the items i and j whenever they are adjacent in G (i.e (i, j) ∈ ...
متن کاملApproximation of the Quadratic Knapsack Problem
We study the approximability of the classical quadratic knapsack problem (QKP) on special graph classes. In this case the quadratic terms of the objective function are not given for each pair of knapsack items. Instead an edge weighted graph G = (V, E) whose vertices represent the knapsack items induces a quadratic profit pij for the items i and j whenever they are adjacent in G (i.e (i, j) ∈ E...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.08.007